Computation of Connection Matrices Using the Software Package Conley
نویسندگان
چکیده
In this paper we demonstrate the power of the computer algebra package conley, which enables one to compute connection and transition matrices, two of the main algebraic tools of the Conley index theory. In particular, we study the Cahn-Hilliard equation on the unit square and extend the results obtained in [Maier-Paape et al., 2007] to a bigger range of the bifurcation parameter. Besides providing several explicit computations using conley, the definition of connection matrices is reconsidered, simplified, and presented in a self-contained manner in the language of Conley index theory. Furthermore, we introduce so-called energy induced bifurcation intervals, which can be utilized by conley to differential equations with a parameter. These bifurcation intervals are used to automatically path-follow the set of connection matrices at bifurcation points of the underlying set of equilibria.
منابع مشابه
conley: Computing connection matrices in Maple
Abstract. In this work we announce the Maple package conley to compute connection and C-connection matrices. conley is based on our abstract homological algebra package homalg. We emphasize that the notion of braids is irrelevant for the definition and for the computation of such matrices. We introduce the notion of triangles that suffices to state the definition of (C)-connection matrices. The...
متن کاملMohamed Barakat &
Abstract. In this work we announce the Maple package conley to compute connection and C-connection matrices. conley is based on our abstract homological algebra package homalg. We emphasize that the notion of braids is irrelevant for the definition and for the computation of such matrices. We introduce the notion of triangles that suffices to state the definition of (C)-connection matrices. The...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملCorrelplot: a collection of functions for plotting correlation matrices
This documents gives some instructions on how to create plots of correlation matrices in the statistical environment R (R Core Team, 2013) using the package Correlplot. The outline of this guide is as follows: Section 2 explains how to install this package and Section 3 shows how to use the functions of the package for creating pictures like correlograms and biplots for a given correlation matr...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 19 شماره
صفحات -
تاریخ انتشار 2009